On the Computational Complexity of Analyzing Hopfield Nets
نویسندگان
چکیده
We prove that the problem of counting the number of stable states in a given Hopfield net is #P-complete and the problem of computing the size of the attraction domain of a given stable state is NP-hard.
منابع مشابه
Some Afterthoughts on Hopfield Networks
The present paper investigates four relatively independent issues each in one section which complete our knowledge regarding the computational aspects of popular Hop eld nets In Section the computational equivalence of convergent asymmetric and Hop eld nets is proved with respect to the network size In Section the convergence time of Hop eld nets is analyzed in terms of bit representations In S...
متن کاملComplexity Issues in Discrete Hoppeld Networks
We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hoppeld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general compu...
متن کاملComplexity Issues in Discrete Hop eldNetworks
We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hoppeld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general compu...
متن کاملComputational Aspects of Analyzing Social Network Dynamics
Motivated by applications such as the spread of epidemics and the propagation of influence in social networks, we propose a formal model for analyzing the dynamics of such networks. Our model is a stochastic version of discrete dynamical systems. Using this model, we formulate and study the computational complexity of two fundamental problems (called reachability and predecessor existence probl...
متن کاملSome Afterthoughts on Hoppeld Networks
The present paper investigates four relatively independent issues, each in one section, which complete our knowledge regarding the computational aspects of popular Hoppeld nets 9]. In Section 2, the computational equivalence of convergent asymmetric and Hoppeld nets is shown with respect to the network size. In Section 3, the convergence time of Hoppeld nets is analyzed in terms of bit represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 3 شماره
صفحات -
تاریخ انتشار 1989